Multicore and Manycore for Algorithm Engineers
نویسندگان
چکیده
From June 27 to July 2, the Dagstuhl Seminar 10261 Algorithm Engineering was held in Schloss Dagstuhl Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The rst section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
منابع مشابه
Multicore vs Manycore: The Energy Cost of Concurrency
In this paper, we study the relation between performance and energy in concurrent programs. As energy efficiency became a key challenge of the computing industry, it is crucial to seek solutions that achieve high performance at a reasonable carbon footprint. We show, however, that energy is dramatically impacted by concurrency and it remains difficult to predict the energy consumed even when th...
متن کاملAn Efficient Parallel Sorting Algorithm for Multicore Machines
Sorting an array of integers is one of the most basic problems in Computer Science. Also it is an issue in high performance database applications. Though literature is imbued with a variety of sorting algorithms, different architectures need different optimizations to reduce sorting time. This paper presents a Multicore ready parallel sorting algorithm which has been designed with Multicore/Man...
متن کاملScalable Local Search on Multicore Computers
Practical computing is undergoing a major shift towards parallelism due to exhaustion of performance gains of other approaches to computer design like increasing clock speed [4]. In a few years, parallel multicore processors with hundreds of concurrent processing threads will be prevalent in common desktop and laptop computers, while web servers having manycore processors will feature even thou...
متن کاملDivide & Conquer on Hybrid Gpu-accelerated Multicore Systems
With the raw compute power of GPUs being more widely available in commodity multicore systems, there is an imminent need to harness their power for important numerical libraries such as LAPACK. In this paper, we consider the solution of dense symmetric and Hermitian eigenproblems by LAPACK’s Divide & Conquer algorithm on such modern heterogeneous systems. We focus on how to make the best use of...
متن کاملHighly Parallel Multigrid Solvers for Multicore and Manycore Processors
In this paper we present an analysis of parallelization properties and implementation details of the new Algebraic multigrid solvers. Variants of smoothers and multicolor grid partitionings are discussed. Optimizations for modern throughput-oriented processors are considered together with different storage schemes. Finally, comparative performance results for multicore and manycore processors a...
متن کامل